Decision procedures for logics of consequential implication.

Optimising Tableaux Decision Procedures for Description Logics

12

Semantic Decision Procedures for Some Relevant Logics

This paper proves decidability of a range of weak relevant logics using decision procedures based on the Routley-Meyer semantics. Logics are categorized as -logics, for those proved decidable using a filtration method, and -logics, for those proved decidable using a direct (unfiltered) method. Both of these methods are set out as reductio methods, in the style of Hughes and Cresswell. We also...

Automata-Theoretic Decision Procedures for Information Logics

More Evaluation of Decision Procedures for Modal Logics

This paper follows on previous papers which presented and evaluated various decision procedures for modal logics. It connrms previous experimental results in showing that SAT based decision procedures, i.e., the procedures built on top of decision procedures for propositional satissability, are more ef-cient than tableau based decision procedures. It also connrms previous evidence of an easy-ha...

Decision Procedures for Propositional Linear-Time Belief-Desire-Intention Logics

The study of situated systems that are capable of reactive and goaldirected behaviour has received increased attention in recent years. One approach to the design of such systems is based upon agent-oriented architectures, in which the system is viewed as a rational agent having certain mental attitudes. The description of these mental attitudes has led to the development of expressive logics t...